Concentration in the Generalized Chinese Restaurant Process
نویسندگان
چکیده
منابع مشابه
Notes 18 : Chinese Restaurant Process
We begin with a proof of the ESF. This is essentially Kingman’s proof (understanding ESF was the main motivation for his introduction of the coalescent). Proof: Let Π be the partition generated by the infinite-alleles model on n sample. We call each set in Π a cluster. Assume there are k clusters. Looking backwards in time, to obtain Π it must be that each cluster undergoes a sequence of coales...
متن کاملThe Dynamic Chinese Restaurant Process via Birth and Death Processes
We develop the Dynamic Chinese Restaurant Process (DCRP) which incorporates time-evolutionary feature in dependent Dirichlet Process mixture models. This model can capture the dynamic change of mixture components, allowing clusters to emerge, vanish and vary over time. All these macroscopic changes are controlled by tracing the birth and death of every single element. We investigate the propert...
متن کاملVariational Inference for the Nested Chinese Restaurant Process
The nested Chinese restaurant process (nCRP) is a powerful nonparametric Bayesian model for learning tree-based hierarchies from data. Since its posterior distribution is intractable, current inference methods have all relied on MCMC sampling. In this paper, we develop an alternative inference technique based on variational methods. To employ variational methods, we derive a tree-based stick-br...
متن کاملHierarchical Topic Models and the Nested Chinese Restaurant Process
We address the problem of learning topic hierarchies from data. The model selection problem in this domain is daunting—which of the large collection of possible trees to use? We take a Bayesian approach, generating an appropriate prior via a distribution on partitions that we refer to as the nested Chinese restaurant process. This nonparametric prior allows arbitrarily large branching factors a...
متن کاملObject Proposal Generation Applying the Distance Dependent Chinese Restaurant Process
In application domains such as robotics, it is useful to represent the uncertainty related to the robot’s belief about the state of its environment. Algorithms that only yield a single “best guess” as a result are not sufficient. In this paper, we propose object proposal generation based on non-parametric Bayesian inference that allows quantification of the likelihood of the proposals. We apply...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sankhya A
سال: 2020
ISSN: 0976-836X,0976-8378
DOI: 10.1007/s13171-020-00210-7